Benders decomposition for the hop-constrainted survivable network design problem
نویسندگان
چکیده
survivable network design problem Quentin Botton Center for Supply Chain Managemqent (CESCM), Louvain School of Management, Université catholique de Louvain, Louvain-la-Neuve, Belgium, and CORE, Université catholique de Louvain, Louvain-la-Neuve, Belgium, [email protected] Bernard Fortz GOM, Department of Computer Science, Faculté des Sciences, Université Libre de Bruxelles, Brussels, Belgium, and CORE, Université catholique de Louvain, Louvain-la-Neuve, Belgium, [email protected] Luis Gouveia Faculdade de Ciências da Universidade de Lisboa, DEIO, CIO Bloco C6, Campo Grande, 1749-016 Lisbon, Portugal, [email protected] Michael Poss GOM, Department of Computer Science, Faculté des Sciences, Université Libre de Bruxelles, Brussels, Belgium, [email protected]
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملOn the hop-constrained survivable network design problem with reliable edges
In this paper, we study the hop-constrained survivable network design problemwith reliable edges. Given a graph with non-negative edge costs and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum cost set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. In addition...
متن کاملA Modified Benders Decomposition Algorithm for Supply Chain Network Design under Risk Consideration
In today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. The supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. This paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. The prob...
متن کاملA Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem
Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...
متن کاملBenders Decomposition for the Hop-Constrained Survivable Network Design Problem
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by Gouveia (1998), we present a formulation for the problem valid for any K, L ! 1. We use a Benders dec...
متن کامل